Consensus in Byzantine asynchronous systems
نویسندگان
چکیده
منابع مشابه
Consensus in byzantine asynchronous systems
This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable failure detector module of the class 3S(bz). The second is a reliable arbitrary behavior detection module. More precisely, the first module detects processes that stop sending messages, while processe...
متن کاملByzantine consensus in asynchronous message-passing systems: a survey
Consensus is a classical distributed systems problem with both theoretical and practical interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the implementation of highlyresilient computing services. This paper surveys Byzantine consensus in message-passing distributed systems, by presenting the main theoretical results in the area, the main classes of algor...
متن کاملBest-Case Complexity of Asynchronous Byzantine Consensus
This paper establishes the first theorem relating resilience, time complexity and authentication in distributed computing. We study consensus algorithms that tolerate Byzantine failures and arbitrary long periods of asynchrony. We measure the ability of processes to reach a consensus decision in a minimal number of rounds of information exchange, as a function of (a) their ability to use authen...
متن کاملThe Complexity of Asynchronous Byzantine Consensus
This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms that tolerate Byzantine failures and arbitrary long periods of asynchrony as in the Internet. The measure expresses the ability of processes to reach a consensus decision in a minimal number of rounds ...
متن کاملBosco: One-Step Byzantine Asynchronous Consensus
Asynchronous Byzantine consensus algorithms are an important primitive for building Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at least two communication steps for decision; in many systems, this imposes a significant performance overhead. In this paper, we show that it is possible to design Byzantine fault-tolerant consensus algorithms that decide in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2003
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00025-x